Multiple Sequence Comparison and Consistency on Multipartite Graphs

Multiple Sequence Comparison and Consistency on Multipartite Graphs

Calculation of dot-matrices is a widespread tool in biological sequence comparison. As a visual aid they are used in pairwise sequence comparison but so far have been of little help in the simultaneous comparison of several sequences. Viewing dot-matrices as projections of unknown n-dimensional points we consider the multiple alignment problem (for n sequences) as an n-dimensional image reconst...

Ranking on Multipartite Graphs

Graphs are commonly used to model complex and large scaled structures. Friendship relations on a social platform, recommendations in big online marketplaces like e-bay or Amazon, or the link structure of the web, are examples for such structures. It is generally accepted (and appreciated) that these huge web structures tend to grow. But with a growing amount of stored data and higher complexity...

On graphs with complete multipartite µ-graphs

Countable homogeneous multipartite graphs

We give a classification of all the countable homogeneous multipartite graphs. This generalizes the similar result for bipartite graphs given in [5]. 2010 Mathematics Subject Classification 05C99 keywords: multipartite graph, homogeneous, classification

Homogeneous coloured multipartite graphs

We classify the countable homogeneous coloured multipartite graphs with any finite number of parts. By Fräıssé’s Theorem this amounts to classifying the families F of pairwise non-embeddable finite coloured multipartite graphs for which the class Forb(F) of multipartite graphs which forbid these is an amalgamation class. We show that once we understand such families F in the quadripartite case,...